#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int K = 5010;
const int mod = 998244353;

int n,m,k;
ll S[K][K],ans;

ll qp(ll x,int t){ll res=1;for(;t;t>>=1,x=x*x%mod)if(t&1)res=res*x%mod;return res;}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in,k = in;
	S[0][0] = 1;
	for(int i = 1;i <= k;i++)
		for(int j = 1;j <= i;j++)
			S[i][j] = (S[i-1][j] * j + S[i-1][j-1]) % mod;
	ll n_ = 1,p_ = 1,p = qp(m,mod-2);
	for(int j = 0;j <= k;j++){
		ans = (ans + S[k][j] * n_ % mod * p_ % mod) % mod;
		n_ = n_ * (n-j) % mod; p_ = p_ * p % mod;
	}
	printf("%lld\n",ans);
	return 0;
}

